Coding for the Large-Alphabet Adversarial Channel
نویسندگان
چکیده
منابع مشابه
Universal channel coding for general output alphabet
We propose a universal channel coding when each output distribution forms an exponential family even in a continuous output system. We propose two types of universal codes; One has the exponentially decreasing error with explicit a lower bound for the error exponent. The other attains the ǫ-capacity up to the second order. Our encoder is the same as the previous paper [CMP 289, 1087]. For our d...
متن کاملOptimal Coding for the Erasure Channel with Arbitrary Alphabet Size
An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes and linear random codes...
متن کاملAlphabet Partitioning Techniques for Semi-Adaptive Huffman Coding of Large Alphabets Alphabet Partitioning Techniques for Semi-Adaptive Huffman Coding of Large Alphabets∗
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each layer. In this paper, we formulate the problem of finding an alphabet partitioning for the design of a two-layer semi-adaptive code as an optimization problem, and give a solution based on dynamic prog...
متن کاملLarge Alphabet Coding and Prediction through Poissonization and Tilting
This paper introduces a convenient strategy for compression and prediction of sequences of independent, identically distributed random variables generated from a large alphabet of size m. In particular, the size of the sample is allowed to be variable. The employment of a Poisson model and tilting method simplifies the implementation and analysis through independence. The resulting strategy is ...
متن کاملOn the Joint Source-Channel Coding Excess Distortion Exponent for Memoryless Continuous-Alphabet Systems
We investigate the joint source-channel coding (JSCC) excess distortion exponent EJ (the exponent of the probability of exceeding a prescribed distortion level) for memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for EJ for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2725280